The Markov Reformulation Theorem

Central and Local Limit Theories in Markov Dependent Random Variables

A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS

In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.

Exact Query Reformulation with Expressive Ontologies and Databases

We study a general framework for query rewriting in the presence of an arbitrary first-order logic ontology over a database signature. The framework supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database signature, and if so, it provides an effective approach to construct the reformulation based on interpolation using standard th...

A Practical Algorithm for Reformulation of Deductive Databases

Database Reformulation is the process of rewriting the data and rules in deductive databases in a functionally equivalent manner, ideally in ways that decrease query processing time while keeping storage costs within acceptable bounds. Early research in this area focussed on materializing existing views, i.e. caching those views as data. Subsequent research extended this work to the problem of ...

Semi-numerical Solution of Stochastic Process Algebra Models

A solution method for solving Markov chains for a class of stochastic process algebra terms is presented. The solution technique is based on a reformulation of the underlying continuous-time Markov chain (CTMC) in terms of semi-Markov processes. For the reformulation only local information about the processes running in parallel is needed, and it is therefore never necessary to generate the com...